A fast algorithm to generate open meandric systems and meanders
نویسندگان
چکیده
منابع مشابه
Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms
By considering a permutation representation for stamp-foldings and semi-meanders we construct tree-like data structures that will allow us to generate these objects in constant amortized time. Additionally, by maintaining the wind-factor and applying an additional optimization, the algorithm for semi-meanders can be modified to produce the fastest known algorithm to generate open meanders.
متن کاملHarmonics Estimation in Power Systems using a Fast Hybrid Algorithm
In this paper a novel hybrid algorithm for harmonics estimation in power systems is proposed. The estimation of the harmonic components is a nonlinear problem due to the nonlinearity of phase of sinusoids in distorted waveforms. Most researchers implemented nonlinear methods to extract the harmonic parameters. However, nonlinear methods for amplitude estimation increase time of convergence. Hen...
متن کاملA fast algorithm to generate Beckett-Gray codes: Extended Abstract
A Gray code is said to be cyclic if the last element and the first element in the sequence also differ by some pre-specified constant amount. The Gray code above demonstrates the cyclic property. It is well known that a cyclic Gray code of binary string corresponds to a Hamilton cycle in the n-dimensional hypercube. Figure 1 shows the 3-dimensional hypercube Q3 with the Hamilton cycle correspon...
متن کاملA fast algorithm to generate necklaces with fixed content
We develop a fast algorithm for listing all necklaces with &xed content. By &xed content, we mean the number of occurrences of each alphabet symbol is &xed. Initially, we construct a simple but ine4cient algorithm by making some basic modi&cations to a recursive necklace generation algorithm. We then improve it by using two classic combinatorial optimization techniques. An analysis using straig...
متن کاملMeanders and Stamp Foldings: Fast Generation Algorithms
By considering a permutation representation for meanders, semi-meanders, and stamp foldings we construct a new data structure that will allow us to extend the order of a given meander, semi-meander, or stamp folding in constant time. Then using this data structure, we develop a constant amortized time algorithm to generate all semi-meanders of order n. By maintaining the wind-factor for semi-me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2010
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1721837.1721858